Fast Polynomial-Space Algorithms Using Inclusion-Exclusion
نویسندگان
چکیده
منابع مشابه
Inclusion-Exclusion Based Algorithms for Graph Colouring
We present a deterministic algorithm producing the number of k-colourings of a graph on n vertices in time 2nnO(1). We also show that the chromatic number can be found by a polynomial space algorithm running in time O(2.2461). Finally, we present a family of polynomial space approximation algorithms that find a number between χ(G) and (1 + )χ(G) in time O(1.2209 + 2.2461 − ).
متن کاملSolving satisfiability using inclusion-exclusion
Using Maple, we implement a SAT solver based on the principle of inclusion-exclusion and the Bonferroni inequalities. Using randomly generated input, we investigate the performance of our solver as a function of the number of variables and number of clauses. We also test it against Maple’s built-in tautology procedure. Finally, we implement the Lovász local lemma with Maple and discuss its appl...
متن کاملInclusion-exclusion meets exclusion
When evaluating the inclusion-exclusion expansion N0 −N(1) −N(2) − · · ·+N(1, 2) +N(1, 3) + · · · many of the terms N(· · ·) may turn out to be zero, and hence should be discarded beforehand. Often this can be done.
متن کاملCauchy-type Inclusion and Exclusion Regions for Polynomial Zeros
A classical result by Cauchy defines a disk containg all the zeros of a polynomial. We derive several related results by using similarity transformations of a polynomial’s companion matrix, together with Gershgorin’s theorem. We thus show that Cauchy’s original result can be seen as but one member of a family of related results. MathEduc Subject Classification: H35 MSC Subject Classification: 9...
متن کاملFast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
We give an O∗(2k)-time algorithm for STEINER TREE using polynomial space, where k is the number of terminals. To obtain this result, we apply Möbius inversion, also known as Inclusion-Exclusion, to the famous Dreyfus-Wagner recurrence. Among our results are also polynomial-space O∗(2n) algorithms for several NP-complete spanning tree and partition problems. With these results, we solve open pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2012
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-012-9630-x